Optimal use of montgomery multiplication on smart cardsBOSCHER, Arnaud; NACIRI, Robert.Lecture notes in computer science. 2006, pp 252-262, issn 0302-9743, isbn 3-540-33311-8, 1Vol, 11 p.Conference Paper

Fast simultaneous scalar multiplication on elliptic curve with Montgomery formAKISHITA, Toru.Lecture notes in computer science. 2001, pp 255-267, issn 0302-9743, isbn 3-540-43066-0Conference Paper

On montgomery-like representations for elliptic curves over GF(2^k)STAM, Martijn.Lecture notes in computer science. 2002, pp 240-253, issn 0302-9743, isbn 3-540-00324-X, 14 p.Conference Paper

Implementation of RSA algorithm based on RNS Montgomery multiplicationNOZAKI, Hanae; MOTOYAMA, Masahiko; SHIMBO, Atsushi et al.Lecture notes in computer science. 2001, pp 364-376, issn 0302-9743, isbn 3-540-42521-7Conference Paper

Representation of elements in F₂m enabling unified field arithmetic for elliptic curve cryptographyCILARDO, A; MAZZEO, A; MAZZOCCA, N et al.Electronics Letters. 2005, Vol 41, Num 14, pp 798-800, issn 0013-5194, 3 p.Article

The Modeling of Harmonious Color Combinations for Improved Usability and UXSTICKEL, Christian; MAIER, Karin; EBNER, Martin et al.Information technology interfaces. 2009, pp 323-328, isbn 978-953-7138-15-8, 1Vol, 6 p.Conference Paper

High-radix design of a scalable modular multiplierTENCA, Alexandre F; TODOROV, Georgi; KOC, Cetin K et al.Lecture notes in computer science. 2001, pp 185-201, issn 0302-9743, isbn 3-540-42521-7Conference Paper

Efficient unified Montgomery inversion with multibit shiftingSAVAS, E; NASEER, M; GUTUB, A. A.-A et al.IEE proceedings. Computers and digital techniques. 2005, Vol 152, Num 4, pp 489-498, issn 1350-2387, 10 p.Article

Bipartite modular multiplicationKAIHARA, Marcelo E; TAKAGI, Naofumi.Lecture notes in computer science. 2005, pp 201-210, issn 0302-9743, isbn 3-540-28474-5, 10 p.Conference Paper

On the power of multidoubling in speeding up elliptic scalar multiplicationSAKAI, Yasuyuki; SAKURAI, Kouichi.Lecture notes in computer science. 2001, pp 268-283, issn 0302-9743, isbn 3-540-43066-0Conference Paper

High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theoremKOO, Bonseok; LEE, Dongwook; RYU, Gwonho et al.Lecture notes in computer science. 2006, pp 81-93, issn 0302-9743, isbn 3-540-49112-0, 1Vol, 13 p.Conference Paper

Power analysis to ECC using differential power between multiplication and squaringAKISHITA, Toru; TAKAGI, Tsuyoshi.Lecture notes in computer science. 2006, pp 151-164, issn 0302-9743, isbn 3-540-33311-8, 1Vol, 14 p.Conference Paper

Energy-efficient software implementation of long integer modular arithmeticGROSSSCHÄDL, Johann; AVANZI, Roberto M; SAVAS, Erkay et al.Lecture notes in computer science. 2005, pp 75-90, issn 0302-9743, isbn 3-540-28474-5, 16 p.Conference Paper

An efficient hardware architecture of a scalable elliptic curve crypto-processor over GF(2ⁿ)TAWALBEH, Loai; TENCA, Alexandre; PARK, Song et al.Proceedings of SPIE, the International Society for Optical Engineering. 2005, pp 59100Q.1-59100Q.11, issn 0277-786X, isbn 0-8194-5915-1, 1VolConference Paper

Montgomery multiplication on FPGA with modified carry-save encodingBUCEK, J; LORENCZ, R.International conference on signals and electronic systems. 2005, pp 313-315, isbn 83-906074-7-6, 1Vol, 3 p.Conference Paper

Montgomery scalar multiplication for genus 2 curvesDUQUESNE, Sylvain.Lecture notes in computer science. 2004, pp 153-168, issn 0302-9743, isbn 3-540-22156-5, 16 p.Conference Paper

Long modular multiplication for cryptographic applicationsHARS, Laszlo.Lecture notes in computer science. 2004, pp 45-61, issn 0302-9743, isbn 3-540-22666-4, 17 p.Conference Paper

Montgomery multiplication over ringsBRENNAN, Joseph P; KATTI, Rajendra.Journal of the Franklin Institute. 2009, Vol 346, Num 1, pp 10-16, issn 0016-0032, 7 p.Article

Improved Montgomery modular inverse algorithmMCIVOR, C; MCLOONE, M; MCCANNY, J. V et al.Electronics Letters. 2004, Vol 40, Num 18, pp 1110-1112, issn 0013-5194, 3 p.Article

Application of Montgomery's trick to scalar multiplication for elliptic and hyperelliptic curves using a fixed base pointPRADEEP KUMAR MISHRA; SARKAR, Palash.Lecture notes in computer science. 2004, pp 41-54, issn 0302-9743, isbn 3-540-21018-0, 14 p.Conference Paper

Implementation of the extended euclidean algorithm for the Tate pairing on FPGAITO, Takehiro; SHIBATA, Yuichiro; OGURI, Kiyoshi et al.Lecture notes in computer science. 2004, pp 911-916, issn 0302-9743, isbn 3-540-22989-2, 6 p.Conference Paper

Another way of doing RSA cryptography in hardwareBATINA, Lejla; MUURLING, Geeke.Lecture notes in computer science. 2001, pp 364-373, issn 0302-9743, isbn 3-540-43026-1Conference Paper

Fast BBS-sequence generation using Montgomery multiplicationPARKER, M. G; KEMP, A. H; SHEPHERD, S. J et al.IEE proceedings. Computers and digital techniques. 2000, Vol 147, Num 4, pp 252-254, issn 1350-2387Article

Hardware architecture for booth-Barrett's modular multiplicationNEDJAH, N; MOURELLE, L. M.International journal of modelling & simulation. 2006, Vol 26, Num 3, pp 183-189, issn 0228-6203, 7 p.Article

Finite Field Polynomial Multiplication in the Frequency Domain with Application to Elliptic Curve CryptographyBAKTIR, Selcuk; SUNAR, Berk.Lecture notes in computer science. 2006, pp 991-1001, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 11 p.Conference Paper